Refinement with Exceptions

نویسندگان

  • Alexander Malkis
  • Andreas Podelski
چکیده

Counterexample-guided abstraction refinement (CEGAR) was successfully applied to verify sequential programs. We give a CEGAR scheme for verifying concurrent programs with threads.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE UNIVERSITY OF QUEENSLAND Queensland 4072 Australia TECHNICAL REPORT

In this paper we discuss the refinement of exceptions. We extend the Guarded Command Language normally used in the refinement calculus, with a simple exception handling statement, which we model using King and Morgan’s exit statement. We derive some variants of King and Morgan’s refinement laws for their exit statement, and illustrate the approach with an example of a refinement of a simple pro...

متن کامل

Learning Rules and Their Exceptions

We present in this article a top-down inductive system, ALLiS, for learning linguistic structures. Two difficulties came up during the development of the system: the presence of a significant amount of noise in the data and the presence of exceptions linguistically motivated. It is then a challenge for an inductive system to learn rules from this kind of data. This leads us to add a specific me...

متن کامل

Covering-based Rough sets Based on the Refinement of Covering-element

Covering-based rough sets is an extension of rough sets and it is based on a covering instead of a partition of the universe. Therefore it is more powerful in describing some practical problems than rough sets. However, by extending the rough sets, covering-based rough sets can increase the roughness of each model in recognizing objects. How to obtain better approximations from the models of a ...

متن کامل

Looking for Exceptions on Knowledge Rules Induced from HIV Cleavage Dataset

The aim of Data Mining (DM) is to find useful knowledge out of databases. In order to extract that knowledge several methods can be used, and Machine Learning (ML) algorithms are among these methods. In our work we focus on ML algorithms that express the extracted knowledge in a symbolic form, such as rules. This representation may allow us to “explain” the data. Besides, symbolic knowledge pro...

متن کامل

A Multi-agent Approach to Modelling Interaction in Human Mathematical Reasoning

Current work in automated reasoning does not in general model social aspects of human mathematics, with a few exceptions, for example [1]. We are interested in modelling concept and conjecture refinement, i.e. the way in which the definition of a concept evolves as a conjecture develops. Modelling this process is important because (a) it will illuminate aspects of the social nature of mathemati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016